Stability has many names

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Many Possible Trade Names are There?

The number of possible distinct names of reasonable length is necessarily finite, and with the heavy demand for new names in some areas of current English-speaking commerce it seems possible that the supply might approach exhaustion. Numbers of possibilities cannot be calculated exactly, because most wordforms theoretically allowed by English phonology are too clumsy to be usable. However, Mont...

متن کامل

Many More Names of (7, 3, 1)

This design, which we call the (7, 3, 1) design, makes appearances in many areas of mathematics. It seems to turn up again and again in unexpected places. An earlier paper in this MAGAZINE [4] described (7, 3, 1)’s appearance in a number of different areas, including finite projective planes, as the Fano plane (FIGURE 1); graph theory, as the Heawood graph and the doubly regular round-robin tou...

متن کامل

An artery has many masters.

D uring the last 25 years, a large number of stimuli have been reported to alter the tone of the coronary arteries. Arterial caliber is now known to be affected by the distending pressure, by factors external to the artery (e.g., neural stimulation and humoral substances in the blood perfusing the arterial wall), by the substances produced by the arterial endothelium, and by metabolically media...

متن کامل

The Many Names of ( 7 , 3 , 1 ) EZRA BROWN

In the world of discrete mathematics, we encounter a bewildering variety of topics with no apparent connection between them. But appearances are deceptive. For example, combinatorics tells us about difference sets, block designs, and triple systems. Geometry leads us to finite projective planes and Latin squares. Graph theory introduces us to round–robin tournaments and map colorings, linear al...

متن کامل

Keisler’s Order Has Infinitely Many Classes

We prove, in ZFC, that there is an infinite strictly descending chain of classes of theories in Keisler’s order. Thus Keisler’s order is infinite and not a well order. Moreover, this chain occurs within the simple unstable theories, considered model-theoretically tame. Keisler’s order is a central notion of the model theory of the 60s and 70s which compares first-order theories (and implicitly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Aequationes mathematicae

سال: 2016

ISSN: 0001-9054,1420-8903

DOI: 10.1007/s00010-016-0429-8